Parallel stochastic methods for PDE based grid generation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel stochastic methods for PDE based grid generation

The efficient generation of meshes is an important step in the numerical solution of various problems in physics and engineering. Here we are interested in situations where global mesh quality and coupling to the physical solution is important. Hence we consider PDE based mesh generation and present a method for the construction of adaptive meshes in two spatial dimensions using domain decompos...

متن کامل

Parallel Smoothing for Grid-Based Methods

Generation of hexahedral meshes using grid-based approaches hold tremendous promise for full automation and scalability. Among the challenges faced, however is the critical mesh quality issue. Although grid-based methods can be general purpose and fully automatic, typical results can often yield unusable elements near the boundaries. In this work we present a practical approach to mesh quality ...

متن کامل

Continuity Methods in Stochastic PDE

Assume we are given a continuously reducible isometry Φ. The goal of the present paper is to study universally Cayley equations. We show that |G| 3 π. A useful survey of the subject can be found in [11]. It is essential to consider that H may be local.

متن کامل

A Paradigm for Parallel Unstructured Grid Generation

In this paper, a sequential 2D unstructured grid generator based on iterative point insertion and local reconnection is coupled with a Delauney tessellation domain decomposition scheme to create a scalable parallel unstructured grid generator. The Message Passing Interface (MPI) is used for distributed communication in the parallel grid generator. This work attempts to provide a generic framewo...

متن کامل

Dynamic Declustering Methods for Parallel Grid Files

Several declustering functions for distributing multi-attribute data on a set of disks have been proposed in recent years. Since these functions map grid regions to disks in a static way, performance deteriorates in case of dynamic datasets and/or non-stationary data distributions. In this paper we first analyze how declustering functions can be extended in order to deal with dynamic datasets w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2014

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2014.07.017